Modeling Non-Iterated System Behavior with Chu Spaces

نویسنده

  • Lubomir Ivanov
چکیده

We present an algorithm for generating Chu space models of the behaviors of arbitrarily complex non-iterated systems including those with N-type dependencies. The generated Chu space can be used for verification of system properties. The application of the model generation algorithm is illustrated with a few examples. Key-Words: concurrency, Chu spaces, system behavior modeling, N-type dependencies

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaotic property for non-autonomous iterated function system

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

متن کامل

Transverse and longitudinal dynamic modeling of bimorph piezoelectric actuators with investigating the effect of vibrational modes

  Bimorph piezoelectric cantilevered (BPC) actuators have recently received a great deal of attention in a variety of micro-electromechanical systems (MEMS) applications. Dynamic modeling of such actuators needs to be improved in order to enhance the control performance. Previous works have usually taken transv...

متن کامل

Modeling Control Flow in WS-BPEL with Chu Spaces

This paper presents a Chu spaces semantics of typical control flow of WS-BPEL including fault handling and link semantics. BPEL-CF is proposed as a simplification of this subset of WS-BPEL. For the compositional modeling of BPEL, the authors present a Chu spaces process algebra. This algebra allows faults to be thrown at any point of execution and take link-based synchronization into considerat...

متن کامل

On bounding boxes of iterated function system attractors

Before rendering 2D or 3D fractals with iterated function systems, it is necessary to calculate the bounding extent of fractals. We develop a new algorithm to compute the bounding box which closely contains the entire attractor of an iterated function system. r 2003 Elsevier Science Ltd. All rights reserved.

متن کامل

Weak $F$-contractions and some fixed point results

In this paper we define weak $F$-contractions on a‎ ‎metric space into itself by extending $F$-contractions‎ ‎introduced by D‎. ‎Wardowski (2012) and provide some fixed point‎ ‎results in complete metric spaces and in partially ordered complete ‎generalized metric spaces‎. ‎Some relationships between weak‎ ‎$F$-contractions and $Fi$-contractions are highlighted‎. ‎We also ‎give some application...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008